Is the Eeort Justiied?

نویسندگان

  • Claudia Czado
  • Axel Munk
چکیده

Generalized linear models (GLMs) allow for a wide range of statistical models for regression data. In particular, the logistic model is usually applied for binomial observations. Canonical links for GLM's such as the logit link in the binomial case, are often used because in this case minimal suucient statistics for the regression parameter exist which allow for simple interpretation of the results. However, in some applications, the overall t as measured by the p-values of goodness of t statistics (as the residual deviance) can be improved signiicantly by the use of a noncanonical link. In this case, the interpretation of the innuence of the covariables is more complicated compared to GLM's with canonical link functions. It will be illustrated through simulation that the p-value associated with the common goodness of link tests is not appropriate to quantify the changes to mean response estimates and other quantities of interest when switching to a noncanonical link. In particular, the rate of misspeciications becomes considerably large, when the inverse information value associated with the underlying parametric link model increases. This shows that the classical tests are often too sensitive, in particular, when the number of observations is large. The consideration of a generalized p-value function is proposed instead, which allows the exact quantiication of a suitable distance to the canonical model at a controlled error rate. Corresponding tests for validating or discriminating the canonical model can easily performed by means of this function. Finally, it is indicated how this method can be applied to the problem of overdispersion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similarities and Reuse of Proofs in Formal Software Veriication Similarities and Reuse of Proofs in Formal Software Veriication

The amount of user interaction is a prime cost factor in interactive program veriication. This paper analyzes situations in which the reuse of previous proofs can help reducing these costs. In particular , it describes a technique that reuses subproofs in the veriication of invariants of state transition systems. This technique replays decisions of generalized previous proof attempts from the s...

متن کامل

Experiments with Program Parallelization Using Archetypes and Stepwise Reenement ?

Parallel programming continues to be diicult and error-prone, whether starting from speciications or from an existing sequential program. This paper presents (1) a methodology for parallelizing sequential applications and (2) experiments in applying the methodology. The methodology is based on the use of stepwise reenement together with what we call parallel programming archetypes (brieey, abst...

متن کامل

Plan Recognition in a Situational

If a plan recognition capability is to be incorporated into an eeective learning environment, it must be designed with the following issues in mind: How much information is required about the per-son's plan, and when must the information be available? How much eeort should be devoted to monitoring the person's actions, as opposed to monitoring the environment in which those actions are carried ...

متن کامل

Formalizing Plan Justi cations

This paper formalizes the notion of justiied plans, which captures the intuition behind \good" plans. A justiied plan is one that does not contain operators which are not necessary for achieving a goal. The importance of formalizing this notion is due to two reasons. First, it gives rise to methods for optimizing a given plan by removing \useless" operators. Second, several important concepts d...

متن کامل

Reconstruction Proofs at the Assertion Level

Most automated theorem provers suuer from the problem that they can produce proofs only in formalisms diicult to understand even for experienced mathematicians. EEort has been made to reconstruct natural deduction (ND) proofs from such machine generated proofs. Although the single steps in ND proofs are easy to understand, the entire proof is usually at a low level of abstraction, containing to...

متن کامل

Kolmogorov Complexity Justifies Software Engineering Heuristics

Many software testing techniques are heuristic, so the \clean bill of health" produced by such a technique does not guarantee that the program is actually correct. In this paper, we show that several heuristic techniques for software testing that have been developed in software engineering can be rigorously justiied. In this justiication, we use Kolmogorov complexity to formalize the terms \sim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000